JOURNAL OF KUNMING METALLURGY COLLEGE ›› 2015, Vol. 31 ›› Issue (5): 60-64.DOI: 10. 3969/j. issn. 1009—0479.2015.05.011
Previous Articles Next Articles
ZHAO Jun-jun,LIU Shi-feng,ZHANG Zhi-yun
Received:
Online:
Published:
Abstract:
On the basis of analyzing the complexity of various algorithms,this paper expounds the principle of parallel algorithms and the design of related parameters to improve the efficiency of real-time algorithms of large-scale urban road network. Based on the deep analysis of the complexity of the algorithm for the shortest path problem,the network segmentation technology of the label algorithm is used to simplify the processing of the road network in Kunming. Parallel algorithm for the shortest path problem is discussed. Through simulation modeling,data confirmed that the parallel optimization algorithm based on the shortest path,even for coarse grid points,the situation subdivision,still be able to ensure a strong speedup and higher operating efficiency and has good portability.
Key words: urban road system, shortest path, parallel algorithm, simulation analysis
CLC Number:
U492. 1
ZHAO Jun-jun,LIU Shi-feng,ZHANG Zhi-yun. Traffic Shortest Path Application Based on the Network Segmentation Technology[J]. JOURNAL OF KUNMING METALLURGY COLLEGE, 2015, 31(5): 60-64.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://kmyzxb.magtech.com.cn/EN/10. 3969/j. issn. 1009—0479.2015.05.011
http://kmyzxb.magtech.com.cn/EN/Y2015/V31/I5/60
[1]PAIGERC,KRUSKALCP.Parallelalgorithmsforshortestpathproblems[C].//InternationalConferenceonParallelProcess ing,UniversityPark,PA,USA:IEEEComputerSocietyPress.1985. [2]隋春丽,谭国真.交通诱导系统的流量预测和路径优化并行算法研究[D].大连:大连理工大学,2009. [3]杨忠明,秦勇.动态路由优化中的最短路径并行计算方法研究进展[J].微计算机应用,2010,8(31):9-11. [4]DIJKSTRAEW.Anoteontwoprobleminconnectionwithgraphs[J].NumericalMathematics.1959,1:269-271. [5]GALLOG,PALLOTTINOS.Shortestpathmethodsintransportationmodels[M].Amsterdam:Elsevier,1984. [6]UdiM.算法引论———一种创造性算法[M].北京:电子工业出版社,2010. [7]迟学斌.高性能并行计算[M].北京:中国科学院计算机信息网络中心,2005. [8]陈国良.并行算法的设计与分析[M].北京:高等教育出版社,2002. [9]TANGZ,PINGXH.A parallel algorithm for computing shortest paths in large-scale net works[J].Lecture Nodes in ComputerScience.2005,3516:975-978.